Ground Temporal Logic :
نویسنده
چکیده
We present a new temporal logic, GTL, appropriate for specifying properties of hardware at the register transfer level. We argue that this logic represents an improvement over model checking for some natural hardware veriication problems. We show that the validity problem for this logic is 1 1 complete. We then identify a fragment of the logic that is decidable. We show that in this fragment we are still able to encode many interesting problems, including the correctness of pipelined microprocessors.
منابع مشابه
Temporally Annotated Extended Logic Programs
Extended logic programs (ELPs) are a set of logic rules with strong negation allowed in the bodies or head of the rules and weak negation ~ allowed in the bodies of the rules. ELPs enable for various forms of reasoning that cannot be achieved by definite logic programs. Answer Set Programming provides a widely acceptable semantics for ELPs. However, ELPs do not provide information regarding t...
متن کاملTowards First-Order Temporal Resolution
In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system ...
متن کاملLocalization of a Ground Robot by Aerial Robots for GPS-Deprived Control with Temporal Logic Constraints
In this work, we present a novel vision-based solution for operating a vehicle under Gaussian Distribution Temporal Logic (GDTL) constraints without global positioning infrastructure. We first present the mapping component that builds a high-resolution map of the environment by flying a team of two aerial vehicles in formation with sensor information provided by their onboard cameras. The contr...
متن کاملTemporal Annotations for a Contextual Logic Programming Language
In this paper we propose the combination of modularity and temporal reasoning using logic programming as common ground. Moreover, we consider that the usage of a given module is influenced by temporal constraints, i.e. modularity and temporal reasoning are strongly connected. Besides illustrative examples, we also present the operational semantics and corresponding compiler for this language.
متن کاملPaving the Way for Temporal Grounding
In this paper we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. We provide several fundamental contributions that pave the way for the implementation of a grounding process, that is, a method that allows replacing variables...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994